Active learning via query synthesis and nearest neighbour search
نویسندگان
چکیده
منابع مشابه
Active learning via query synthesis and nearest neighbour search
Active learning has received great interests from researchers due to its ability to reduce the amount of supervision required for effective learning. As the core component of active learning algorithms, query synthesis and pool-based sampling are two main scenarios of querying considered in the literature. Query synthesis features low querying time, but only has limited applications as the synt...
متن کاملFast k-Nearest Neighbour Search via Dynamic Continuous Indexing
Existing methods for retrieving k-nearest neighbours suffer from the curse of dimensionality. We argue this is caused in part by inherent deficiencies of space partitioning, which is the underlying strategy used by almost all existing methods. We devise a new strategy that avoids partitioning the vector space and present a novel randomized algorithm that runs in time linear in dimensionality an...
متن کاملRealtime Registration-Based Tracking via Approximate Nearest Neighbour Search
We introduce a new 2D visual tracking algorithm that utilizes an approximate nearest neighbour search to estimate per-frame state updates. We experimentally demonstrate that the new algorithm capable of estimating larger per-frame motions than the standard registration-based algorithms and that it is more robust in a vision-controlled robotic alignment task.
متن کاملFast k-Nearest Neighbour Search via Prioritized DCI
Most exact methods for k-nearest neighbour search suffer from the curse of dimensionality; that is, their query times exhibit exponential dependence on either the ambient or the intrinsic dimensionality. Dynamic Continuous Indexing (DCI) (Li & Malik, 2016) offers a promising way of circumventing the curse by avoiding space partitioning and achieves a query time that grows sublinearly in the int...
متن کاملNearest Neighbour Search for Visualization Using Arbitrary Triangulations Nearest Neighbour Search for Visualization Using Arbitrary Triangulations
In visualization of scattered data, one is often faced with the problem of nding the nearest neighbours of a data site. This task frequently occurs in an advanced stage of the visualization process, where several data structures have been created during run time. Many applications compute a triangulation of the data for their visualization purposes. To take advantage of this previously allocate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2015
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2014.06.042